Hardware Parallel Architecture of a 3 D Surface Reconstruction : Marching Cubes Algorithm
نویسندگان
چکیده
In this paper we present a study of the algorithmic and architectural exploration methodology for a parallelism of the 3D reconstructing algorithm (Marching Cubes) and its optimized implementation on FPGA. We aim at defining a parallel multiprocessor architecture implementing this algorithm in an optimal way and Elementary Processor (EP) architecture dedicated to this algorithm. We use the SynDEx tool which adapts the AAA (Algorithm Architecture Adequacy) methodology, to find a good compromise between the computing power, the functionality of each PE, the optimization constraint (time, area), and the parallelization efficiency. Then, we describe a first implementation of PE on FPGA Keywords—3D reconstruction, Marching Cubes, Optimization AAA, FPGA, SynDEx.
منابع مشابه
Marching Cubes in an Unsigned Distance Field for Surface Reconstruction from Unorganized Point Sets
Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...
متن کاملGPU Local Triangulation: an interpolating surface reconstruction algorithm
A GPU capable method for surface reconstruction from unorganized point clouds without additional information, called GLT (GPU Local Triangulation), is presented. The main objective of this research is the generation of a GPU interpolating reconstruction based on local Delaunay triangulations, inspired by a pre-existing reconstruction algorithm. Current graphics hardware accelerated algorithms a...
متن کاملHistoPyramids in Iso-Surface Extraction
We present an implementation approach to high-speed Marching Cubes, running entirely on the Graphics Processing Unit of Shader Model 3.0 and 4.0 graphics hardware. Our approach is based on the interpretation of Marching Cubes as a stream compaction and expansion process, and is implemented using the HistoPyramid, a hierarchical data structure previously only used in GPU data compaction. We exte...
متن کاملReal-Time Marching Cubes on the Vertex Shader
In this paper we propose a new approach for visualizing volumetric datasets by their isosurfaces. For an interactive isosurface reconstruction an optimized version of the well-known marching cubes algorithm is used. We extend the original algorithm by an additional vertex shader program. Contrary to other hardware-accelerated solutions our program is not based on a tetrahedral algorithm and thu...
متن کاملFluid Surface Reconstruction from Particles
Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained optimization problem. Our algorithm incorporates a secondary contribution in Marching Tiles, a gene...
متن کامل